package com.datastructure;

import java.util.Arrays;
import java.util.LinkedList;

public class BinaryTreeBianLiTest
{

    public static void main(String[] args)
    {
        LinkedList<Integer> inputList = new LinkedList<Integer>(Arrays.asList(new Integer[]{3, 2, 9, null, null, 10, null, null, 8, null, 4}));
        TreeNode treeNode = BinaryTreeBianLi.createBinaryTree(inputList);
        System.out.println("前序输出:");
        BinaryTreeBianLi.preOutPrint(treeNode);
        System.out.println("中序输出:");
        BinaryTreeBianLi.minOutPrint(treeNode);
        System.out.println("后序输出:");
        BinaryTreeBianLi.lastOutPrint(treeNode);

    }

}
